Reduced crossbar switch with minimum number of switching cellsOBARA, H.Electronics Letters. 2008, Vol 44, Num 14, pp 888-889, issn 0013-5194, 2 p.Article

Genetic algorithm based OSPF network routing using LEDATANG, Lenny; WIESE, Kay; KUMAR, Vive et al.Lecture notes in computer science. 2004, pp 571-572, issn 0302-9743, isbn 3-540-22004-6, 2 p.Conference Paper

Compact routing in directed networks with stretch factor of twoCHANDRA, Punit; KSHEMKALYANI, Ajay D.Lecture notes in computer science. 2001, pp 24-35, issn 0302-9743, isbn 3-540-43009-1Conference Paper

A new intuitional algorithm for solving heterogeneous fixed fleet routing problems : Passenger pickup algorithmGENCER, Cevriye; TOP, Ismail; AYDOGAN, Emel Kizilkaya et al.Applied mathematics and computation. 2006, Vol 181, Num 2, pp 1552-1567, issn 0096-3003, 16 p.Article

Structural information and communication complexityPELEG, David; SIBEYN, Jop.Theoretical computer science. 2005, Vol 333, Num 3, issn 0304-3975, 128 p.Conference Proceedings

Routing algorithms for DHTs: Some open questionsRATUASAINY, Sylvia; STOICA, Ion; SHENKER, Scott et al.Lecture notes in computer science. 2002, pp 45-52, issn 0302-9743, isbn 3-540-44179-4, 8 p.Conference Paper

A heuristic routing algorithm for shared protection in connection-oriented networksSHENGLI YUAN; JUE, Jason.SPIE proceedings series. 2001, pp 142-152, isbn 0-8194-4331-XConference Paper

An algorithm for node-capacitated ring routingFRANK, Andras; KIRALY, Zoltan; KOTNYEK, Balazs et al.Lecture notes in computer science. 2005, pp 249-258, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 10 p.Conference Paper

A genetic routing algorithm for a 2D-meshed fault-tolerant network systemSANGMOON LEE; DAEKEUN MOON; HAGBAE KIM et al.Lecture notes in computer science. 2002, pp 39-46, issn 0302-9743, isbn 3-540-43968-4, 8 p.Conference Paper

Flexible routing in a mesh networkWAHIDA BANU, R. S. D; VARAPRASAD, G; GOWRI SANKAR, S et al.Digital information exchange. Annual conference. 2004, pp 411-417, 1Vol, 7 p.Conference Paper

kd-Clos: New no-blocking permutation networkMEI MING; DONG LI; BO FU et al.Lecture notes in computer science. 2003, pp 152-156, issn 0302-9743, isbn 3-540-20054-1, 5 p.Conference Paper

A noble routing algorithm for the internet computational GRIDYOUNGYONG KIM.Lecture notes in computer science. 2002, pp 33-37, issn 0302-9743, isbn 3-540-43968-4, 5 p.Conference Paper

Remote time-alignment of interactive services through efficient multicast algorithmsBORELLA, Andrea; CANCELLIERI, Giovanni.European conference on universal multiservice networks. 2000, pp 239-246, isbn 0-7803-6419-8Conference Paper

Artificial Potential Field and its application to the ship in dynamic uncertain environmentsYUANHUI LI; WEI GUAN; DEPENG ZHAO et al.Proceedings of SPIE, the International Society for Optical Engineering. 2007, pp 67902Z.1-67902Z.8, issn 0277-786X, isbn 978-0-8194-6954-0Conference Paper

Deterministic SkipNetHARVEY, Nicholas J. A; MUNRO, J. Ian.Information processing letters. 2004, Vol 90, Num 4, pp 205-208, issn 0020-0190, 4 p.Article

A mixed deflection and convergence routing algorithm: Design and performanceBARTH, D; BERTHOME, P; CZARCHOSKI, T et al.Lecture notes in computer science. 2002, pp 767-774, issn 0302-9743, isbn 3-540-44049-6, 8 p.Conference Paper

A new routing algorithm for delay-constrained dynamic multicastASAKA, Takuya; MIYOSHI, Takumi; TANAKA, Yoshiaki et al.European conference on universal multiservice networks. 2000, pp 231-238, isbn 0-7803-6419-8Conference Paper

A Dynamic Routing Algorithm for Multi-Domain Photonic Networks using Averaged Link Load InformationSHIMADA, Kohei; ARAKI, Soichiro; HASEGAWA, Hiroshi et al.Proceedings of SPIE, the International Society for Optical Engineering. 2009, Vol 7633, issn 0277-786X, isbn 978-0-8194-8035-4 0-8194-8035-5, 1Vol, 76331F.1-76331F.5Conference Paper

An Edge Ordering Problem of Regular HypergraphsHONGBING FAN; KALBFLEISCH, Robert.Lecture notes in computer science. 2006, pp 368-377, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Optical Path Dynamic Routing Algorithm based on Traffic PredictionOBARA, Keita; HASEGAWA, Hiroshi; SATO, Ken-Ichi et al.Proceedings of SPIE, the International Society for Optical Engineering. 2008, Vol 7137, issn 0277-786X, isbn 9780819473776, Part II, 713724.1-713724.5, 2Conference Paper

A limited path unicast QoS routing algorithmYANXING ZHENG; JING TIAN; ZHIFENG LIU et al.IEEE symposium on computers communications. 2004, isbn 0-7803-8623-X, 2Vol, vol2, 870-875Conference Paper

A list based threshold accepting algorithm for the capacitated vehicle routing problemTARANTILIS, C. D; KIRANOUDIS, C. T; VASSILIADIS, V. S et al.International journal of computer mathematics. 2002, Vol 79, Num 5, pp 537-553, issn 0020-7160Article

An approximation algorithm for the pickup and delivery vehicle routing problem on treesKATOH, Naoki; YANO, Taihei.Discrete applied mathematics. 2006, Vol 154, Num 16, pp 2335-2349, issn 0166-218X, 15 p.Conference Paper

One-staged wormhole routing for irregular faulty patterns in meshesTSAI, Ming-Jer.International conference on parallel and distributed simulation. 2004, pp 569-576, isbn 0-7695-2152-5, 1Vol, 8 p.Conference Paper

Low-Delay Dynamic Routing Using Fountain CodesBADARLA, Venkataramana; SUBRAMANIAN, Vijay; LEITH, Douglas J et al.IEEE communications letters. 2009, Vol 13, Num 7, pp 552-554, issn 1089-7798, 3 p.Article